A stochastic a posteriori updating algorithm for pattern recognition

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stochastic Algorithm for Feature Selection in Pattern Recognition

We introduce a new model addressing feature selection from a large dictionary of variables that can be computed from a signal or an image. Features are extracted according to an efficiency criterion, on the basis of specified classification or recognition tasks. This is done by estimating a probability distribution P on the complete dictionary, which distributes its mass over the more efficient...

متن کامل

A Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition

In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...

متن کامل

A general algorithm for pattern recognition?

absolute limits of temporal resolution in the auditory pathway because it coincides with the shortest boundary of voice onset time perception in man, monkey, and chinchilla and with thresholds of perception of temporal order in humans (compare Ehret 1987). These cases show that categorical perception in Massaro's sense is likely to exist and should not be abandoned as a possibility for human sp...

متن کامل

A Simple Implementation of the Stochastic Discrimination for Pattern Recognition

The method of stochastic discrimination (SD) introduced by Kleinberg ([6,7])is a new method in pattern recognition. It works by producing weak classifiers and then combining them via the Central Limit Theorem to form a strong classifier. SD is overtraining-resistant, has a high convergence rate, and can work quite well in practice. However, some strict assumptions involved in SD and the difficu...

متن کامل

A novel grey–fuzzy–Markov and pattern recognition model for industrial accident forecasting

Industrial forecasting is a top-echelon research domain, which has over the past several years experienced highly provocative research discussions. The scope of this research domain continues to expand due to the continuous knowledge ignition motivated by scholars in the area. So, more intelligent and intellectual contributions on current research issues in the accident domain will potentially ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1967

ISSN: 0022-247X

DOI: 10.1016/0022-247x(67)90096-0